Chromatic Polynomials of Some Nanotubes
نویسندگان
چکیده
Let ) , ( λ χ G denotes the number of proper vertex colourings of with at most G λ colours. G. Birkhoff , observed in 1912 that ) , ( λ χ G is, for a fixed graph , a polynomial in G λ , which is now called the chromatic polynomial of . More precisely, let G be a simple graph and G N ∈ λ . A mapping } , {1,2, ) ( : λ K → G V f is called a λ -colouring of if whenever the vertices and are adjacent in G . The number of distinct G ) (v ) ( f u f ≠ u v λ -colourings of G , denoted by ) , ( λ G P is called the chromatic polynomial of . A zero of G ) , ( λ G P is called a chromatic zero of G . The book by F.M. Dong, K.M. Koh and K.L. Teo gives an excellent and extensive survey of this polynomial and its root. A topological index is a real number related to a graph. It must be a structural invariant, i.e., it is fixed by any automorphism of the graph. There are several topological indices have been defined and many of them have found applications as means to model chemical, pharmaceutical and other properties of molecules. The Wiener index W and diameter are two examples of topological indices of graphs (or chemical model). For a detailed treatment of these indices, the reader is referred to .
منابع مشابه
Chromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملChromatic polynomials of some mixed hypergraphs
Motivated by a recent result of Walter [Electron. J. Combin. 16 (2009), R94] concerning the chromatic polynomials of some hypergraphs, we present the chromatic polynomials of several (non-uniform) mixed hypergraphs. We use a recursive process for generating explicit formulae for linear mixed hypercacti and multi-bridge mixed hypergraphs using a decomposition of the underlying hypergraph into bl...
متن کاملChromatic polynomials of hypergraphs
In this paper we present some hypergraphs which are chromatically characterized by their chromatic polynomials. It occurs that these hypergraphs are chromatically unique. Moreover we give some equalities for the chromatic polynomials of hypergraphs generalizing known results for graphs and hypergraphs of Read and Dohmen.
متن کامل